Integer Constraints for Train Series Connections
نویسندگان
چکیده
The scheduling of train services is subject to a number of constraints describing railway infrastructure, required train services and reasonable time-intervals for waiting and transits. Timetable planners at Dutch Railways are nowadays supported by a software tool, called CADANS, which produces a feasible timetable on an hourly basis. In this paper, connection requirements between train series are written in the format of the CADANS model. It turns out that this leads to nontrivial combinatorial scheduling issues.
منابع مشابه
Simultaneous disruption recovery of a train timetable and crew roster in real time
This paper describes the development and implementation of an optimization model used to resolve disruptions to an operating schedule in the rail industry. Alterations to the existing train timetable and crewing roster are made simultaneously in real time—previous treatments in the literature have always decoupled these two problems and solved them in series. An integer programming model is dev...
متن کاملCost Optimal Train Scheduling
For some real world railroad networks, we minimize certain operational cost of train schedules which allow different train types of diverse speed and cost. We use a mixed integer linear programming approach to model this train scheduling problem. For practical problem sizes, it is impossible to directly solve the resulting MIPs within a reasonable amount of time. However, a decomposition approa...
متن کاملAn integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling
An integer fixed-charge multicommodity flow (FCMF) model is used as the first part of a two-phase approach for train unit scheduling, and solved by an exact branchand-price method. To strengthen knapsack constraints and deal with complicated scenarios arisen in the integer linear program (ILP) from the integer FCMF model, preprocessing is used by computing convex hulls of sets of points represe...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملCost optimal periodic train scheduling
For real world railroad networks, we consider minimizing operational cost of train schedules which depend on choosing different train types of diverse speed and cost. We develop a mixed integer linear programming model for this train scheduling problem. For practical problem sizes, it seems to be impossible to directly solve the model within a reasonable amount of time. However, suitable decomp...
متن کامل